A simple and robust thinning algorithm on cell complexes
نویسندگان
چکیده
منابع مشابه
A simple and robust thinning algorithm on cell complexes
Thinning is a commonly used approach for computing skeleton descriptors. Traditional thinning algorithms often have a simple, iterative structure, yet producing skeletons that are overly sensitive to boundary perturbations. We present a novel thinning algorithm, operating on objects represented as cell complexes, that preserves the simplicity of typical thinning algorithms but generates skeleto...
متن کاملThinning on cell complexes from polygonal tilings
This paper provides a theoretical foundation of a thinning method due to Kovalevsky for 2D digital binary images modelled by cell complexes or, equivalently, by Alexandroff T0 topological spaces, whenever these are constructed from polygonal tilings. We analyze the relation between local and global simplicity of cells, and prove their equivalence under certain conditions. For the proof we apply...
متن کاملThinning on Quadratic, Triangular, and Hexagonal Cell Complexes
This paper deals with a thinning algorithm proposed in 2001 by Kovalevsky, for 2D binary images modelled by cell complexes, or, equivalently, by Alexandroff T0 spaces. We apply the general proposal of Kovalevsky to cell complexes corresponding to the three possible normal tilings of congruent convex polygons in the plane: the quadratic, the triangular, and the hexagonal tilings. For this case, ...
متن کاملA robust algorithm for forming note complexes
We describe a new algorithm to transcribe musical note complexes from polyphonic piano music. Our method is a spectrogram based algorithm, which uses a robust peak detection scheme and forms note complexes by multiple sample conditional probability in the context of a time-frequency based finite state space approach, where note onsets are determined implicitly by changes in subharmonics. This p...
متن کاملA Simple Algorithm for Robust Mpc
The majority of recent works on robust MPC either require very burdensome online computations or are restricted to relatively small feasible regions. This paper builds on a recent work which demonstrated that one could compute the maximal admissible set for a linear parameter varying system and shows how this set can be used as the terminal region and hence allows the definition of an MPC algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2010
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2010.01814.x